Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
نویسندگان
چکیده
منابع مشابه
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The ...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کامل9839 AGGREGATION and MIXED INTEGER ROUNDING toSOLVE
A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of \strong" valid inequalities for speciic models and computationally gives results as good as or better than those obtained from several existing separation routines including ow cover and integer cover inequalities. The heuristic is based on aggregation of constraints of the...
متن کاملOn n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
Pochet and Wolsey [Y. Pochet, L.A. Wolsey, Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discrete Applied Mathematics 59(1995) 57–74] introduced partition inequalities for three substructures arising in various mixed integer programs, namely the integer knapsack set with nonnegative divisible/arbitrary coefficients and two forms of single-...
متن کاملGeneralized Mixed Integer Rounding Valid Inequalities
We present new families of valid inequalities for (mixed) integer programming (MIP) problems. These valid inequalities are based on a generalization of the 2-step mixed integer rounding (MIR), proposed by Dash and Günlük (2006). We prove that for any positive integer n, n facets of a certain (n + 1)-dimensional mixed integer set can be obtained through a process which includes n consecutive app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2007
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-007-0171-7